Logical characterization of fluid equivalences
نویسندگان
چکیده
منابع مشابه
Logical characterization of probabilistic τ -bisimulation equivalences
Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...
متن کاملEquivalences among Various Logical Frameworks of Partial Algebras
We examine a variety of liberal logical frameworks of partial algebras. Therefore we use simple, conjunctive and weak embeddings of institutions which preserve model categories and may map sentences to sentences, nite sets of sentences, or theory extensions using unique-existential quantiiers, respectively. They faithfully represent theories, model categories, theory morphisms, colimit of theor...
متن کاملBehavioural equivalences for fluid stochastic Petri nets
We propose fluid equivalences that allow one to compare and reduce behaviour of labeled fluid stochastic Petri nets (LFSPNs) while preserving their discrete and continuous properties. We define a linear-time relation of fluid trace equivalence and its branching-time counterpart, fluid bisimulation equivalence. Both fluid relations take into account the essential features of the LFSPNs behaviour...
متن کاملLinear logical relations and observational equivalences for session-based concurrency
We investigate strong normalization, confluence, and behavioral equality in the realmof session-based concurrency. These interrelated issues underpin advanced correctnessanalysis in models of structured communications. The starting point for our study isan interpretation of linear logic propositions as session types for communicating pro-cesses, proposed in prior work. Strong no...
متن کاملA Teaching Tool for Proving Equivalences between Logical Formulae
In this paper we describe a teaching tool for proving equivalences between propositional logic formulae, using rewrite rules such as De Morgan’s laws and double negation. This tool is based on an earlier tool for rewriting logical formulae into disjunctive normal form (DNF). Both tools make use of a rewrite strategy, which specifies how an exercise can be solved stepwise. Different types of fee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sibirskie Elektronnye Matematicheskie Izvestiya
سال: 2018
ISSN: 1813-3304
DOI: 10.33048/semi.2019.16.055